Bandwidth scheduling for big data transfer with two variable node-disjoint paths
نویسندگان
چکیده
منابع مشابه
Maximum-Bandwidth Node-Disjoint Paths
This paper presents a new method for finding the node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an NP-complete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a maximum-cost variant of Dijkstra algorithm and a virtual-node representation to obtain the maximum-bandwidth nod...
متن کاملLoad Balancing Using Multiple Node Disjoint Paths
This paper discusses the multiple node disjoint paths protocol (MNDP) for mobile ad hoc networks. A mobile ad hoc network is a collection of mobile nodes that cooperate without networking infrastructure so as to form a temporary network that meets some immediate needs. The MNDP protocol detects multiple paths and distributes transmitted packets over these paths. Such distribution reduces conges...
متن کاملOn Approximating Node-Disjoint Paths in Grids
In the Node-Disjoint Paths (NDP) problem, the input is an undirected n-vertex graph G, and a collection {(s1, t1), . . . , (sk, tk)} of pairs of vertices called demand pairs. The goal is to route the largest possible number of the demand pairs (si, ti), by selecting a path connecting each such pair, so that the resulting paths are node-disjoint. NDP is one of the most basic and extensively stud...
متن کاملShortest node-disjoint paths on random graphs
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length ...
متن کاملAn Algorithm for Node-Disjoint Paths in Pancake Graphs
For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n − 1 internally disjoint paths connecting the nodes in the time complexity of polynomial order of n. The length of each path obtained and the time complexity of the algorithm are estimated theoretically and verified by computer simulation. key words: pancake graphs, node-to-node disjoint paths proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Communications and Networks
سال: 2020
ISSN: 1229-2370,1976-5541
DOI: 10.1109/jcn.2020.000004